A Fast Algorithm for Selective Signal Extrapolation with Arbitrary Basis Functions
نویسندگان
چکیده
منابع مشابه
A Fast Algorithm for Selective Signal Extrapolation with Arbitrary Basis Functions
Signal extrapolation is an important task in digital signal processing for extending known signals into unknown areas. The Selective Extrapolation is a very effective algorithm to achieve this. Thereby, the extrapolation is obtained by generating a model of the signal to be extrapolated as weighted superposition of basis functions. Unfortunately, this algorithm is computationally very expensive...
متن کاملA kernel independent fast multipole algorithm for radial basis functions
We present a fast multipole algorithm for the evaluation of pairwise interaction through the radial basis functions such as 1/r, ffiffiffiffiffiffiffiffiffiffiffiffiffiffi r2 þ a2 p and 1= ffiffiffiffiffiffiffiffiffiffiffiffiffiffi r2 þ a2 p (with a > 0) in both two and three dimensions. Our algorithm is an extension of the kernel independent fast multipole method presented in Ying et al. [L. Y...
متن کاملReshuffling: a fast algorithm for filtering with arbitrary kernels
A Novel method to accelerate the application of linear filters that have multiple identical coefficients on arbitrary kernels is presented. Such filters, including Gabor filters, gray level morphological operators, volume smoothing functions, etc., are wide used in many computer vision tasks. By taking advantage of the overlapping area between the kernels of the neighboring points, the reshuffl...
متن کاملA Fast Algorithm for Spherical Basis Approximation
Radial basis functions appear in a wide field of applications in numerical mathematics and computer science. We present a fast algorithm for scattered data interpolation and approximation on the sphere with spherical radial basis functions of different spatial density. We discuss three settings, each leading to a special structure of the interpolation matrix allowing for an efficient implementa...
متن کاملA Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURASIP Journal on Advances in Signal Processing
سال: 2011
ISSN: 1687-6180
DOI: 10.1155/2011/495394